PHotometry Assisted Spectral Extraction (PHASE) and identification of SNLS supernovae

Aim: We present new extraction and identification techniques for supernova (SN) spectra developed within the Supernova Legacy Survey (SNLS) collaboration. Method: The new spectral extraction method takes full advantage of photometric information from the Canada-France-Hawai telescope (CFHT) discovery and reference images by tracing the exact position of the supernova and the host signals on the spectrogram. When present, the host spatial profile is measured on deep multi-band reference images and is used to model the host contribution to the full (supernova + host) signal. The supernova is modelled as a Gaussian function of width equal to the seeing. A chi-square minimisation provides the flux of each component in each pixel of the 2D spectrogram. For a host-supernova separation greater than <~ 1 pixel, the two components are recovered separately and we do not use a spectral template in contrast to more standard analyses. This new procedure permits a clean extraction of the supernova separately from the host in about 70% of the 3rd year ESO/VLT spectra of the SNLS. A new supernova identification method is also proposed. It uses the SALT2 spectrophotometric template to combine the photometric and spectral data. A galaxy template is allowed for spectra for which a separate extraction of the supernova and the host was not possible. Result: These new techniques have been tested against more standard extraction and identification procedures. They permit a secure type and redshift determination in about 80% of cases. The present paper illustrates their performances on a few sample spectra.Comment: 27 pages, 18 Figures, 1 Table. Accepted for publication in A&

Collision-induced galaxy formation: semi-analytical model and multi-wavelength predictions

A semi-analytic model is proposed that couples the Press-Schechter formalism for the number of galaxies with a prescription for galaxy-galaxy interactions that enables to follow the evolution of galaxy morphologies along the Hubble sequence. Within this framework, we calculate the chemo-spectrophotometric evolution of galaxies to obtain spectral energy distributions. We find that such an approach is very successful in reproducing the statistical properties of galaxies as well as their time evolution. We are able to make predictions as a function of galaxy type: for clarity, we restrict ourselves to two categories of galaxies: early and late types that are identified with ellipticals and disks. In our model, irregulars are simply an early stage of galaxy formation. In particular, we obtain good matches for the galaxy counts and redshift distributions of sources from UV to submm wavelengths. We also reproduce the observed cosmic star formation history and the diffuse background radiation, and make predictions as to the epoch and wavelength at which the dust-shrouded star formation of spheroids begins to dominate over the star formation that occurs more quiescently in disks. A new prediction of our model is a rise in the FIR luminosity density with increasing redshift, peaking at about $z\sim 3$, and with a ratio to the local luminosity density $\rho_{L,\nu} (z = z_{peak})/ \rho_{L,\nu} (z = 0)$ about 10 times higher than that in the blue (B-band) which peaks near $z\sim 2$

Cyclic voltammetry modeling of proton transport effects on redox charge storage in conductive materials: application to a TiO2 mesoporous film

International audienc

Generic Encodings of Constructor Rewriting Systems

Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the negation over patterns. We propose in this paper a concise and clear algorithm computing the difference over patterns which can be used to define generic encodings of constructor term rewriting systems with negation and order into classical term rewriting systems. As a direct consequence, established methods used for term rewriting systems can be applied to analyze properties of the extended systems. The approach can also be seen as a generic compiler which targets any language providing basic pattern matching primitives. The formalism provides also a new method for deciding if a set of patterns subsumes a given pattern and thus, for checking the presence of useless patterns or the completeness of a set of patterns.Comment: Added appendix with proofs and extended example